Computing with cells: membrane systems – some complexity issues

Computing with cells: membrane systems - some complexity issues

Membrane computing is a branch of natural computing which abstracts computing models from the structure and the functioning of the living cell. The main ingredients of membrane systems, called P systems, are (i) the membrane structure, which consists of a hierarchical arrangements of membranes which delimit compartments where (ii) multisets of symbols, called objects, evolve according to (iii) ...

Some ‘complexity’ issues for ill-posed problems

A ‘correct’ interpretation of the computational complexity of an ill-posed problem is formulated as a cost/effectiveness balance for the use of available data to obtain adequate solutions for an application. This composition with an application, is seen as the real problem, leading to the conclusion that some apparently ill-posed problems are, in context, really well-posed with a reasonable ass...

Some Complexity Issues in Complex Analysis

A Computational Complexity Theory in Membrane Computing

In this paper, a computational complexity theory within the framework of Membrane Computing is introduced. Polynomial complexity classes associated with different models of cell-like and tissue-like membrane systems are defined and the most relevant results obtained so far are presented. Many attractive characterizations of P 6= NP conjecture within the framework of a bio-inspired and non-conve...

Computational Complexity Aspects in Membrane Computing

Within the framework of membrane systems, distributed parallel computing models inspired by the functioning of the living cell, various computational complexity classes have been defined, which can be compared against the computational complexity classes defined for Turing machines. Here some issues and results concerning computational complexity of membrane systems are discussed. In particular...